Ḥelek 2. Toroto shel Rabenu bi-lesh. ha-ḳ. ... maʼamarim shonim be-Idish ... sheʼelot u-teshuvot ba-ʻavodat ha-Sh. yit ... shivḥo shel tsadiḳ.

32 inspirational shmuessen filled with anecdotes and stories, delivered by the renowned Mashgiach of the Kamenitz Yeshiva.

By forcing over a model of with a class-sized partial order preserving this theory we produce a model in which there is a locally defined well-order of the universe; that is, one whose restriction to all levels H is a well-order of H definable over the structure H, by a parameter-free formula. Further, this forcing construction preserves all supercompact cardinals as well as all instances of regular local supercompactness. It is also possible to define variants of this construction which, in (...) addition to forcing a locally defined well-order of the universe, preserve many of the n-huge cardinals from the ground model. (shrink)

Assuming ${2^{{N_0}}}$ = N₁ and ${2^{{N_1}}}$ = N₂, we build a partial order that forces the existence of a well-order of H(ω₂) lightface definable over ⟨H(ω₂), Є⟩ and that preserves cardinal exponentiation and cofinalities.

Capitalism is the best. It's free enterprise. Barter. Gimbels, if I get really rank with the clerk, 'Well I don't like this', how I can resolve it? If it really gets ridiculous, I go, 'Frig it, man, I walk.' What can this guy do at Gimbels, even if he was the president of Gimbels? He can always reject me from that store, but I can always go to Macy's. He can't really hurt me. Communism is like one big phone company. (...) Government control, man. And if I get too rank with that phone company, where can I go? I'll end up like a schmuck with a dixie cup on a thread. (shrink)

In this paper we introduce some fusion properties of forcing notions which guarantee that an iteration with supports of size ⩽κ not only does not collapse κ+ but also preserves the strength of κ. This provides a general theory covering the known cases of tree iterations which preserve large cardinals [3], Friedman and Halilović [5], Friedman and Honzik [6], Friedman and Magidor [8], Friedman and Zdomskyy [10], Honzik [12]).

We show that there is a [Formula: see text]-model of second-order arithmetic in which the choice scheme holds, but the dependent choice scheme fails for a [Formula: see text]-assertion, confirming a conjecture of Stephen Simpson. We obtain as a corollary that the Reflection Principle, stating that every formula reflects to a transitive set, can fail in models of [Formula: see text]. This work is a rediscovery by the first two authors of a result obtained by the third author in [V. (...) G. Kanovei, On descriptive forms of the countable axiom of choice, Investigations on nonclassical logics and set theory, Work Collect., Moscow, 3-136 ]. (shrink)

There are two standard ways to establish consistency in set theory. One is to prove consistency using inner models, in the way that Gödel proved the consistency of GCH using the inner model L. The other is to prove consistency using outer models, in the way that Cohen proved the consistency of the negation of CH by enlarging L to a forcing extension L[G].But we can demand more from the outer model method, and we illustrate this by examining Easton's strengthening (...) of Cohen's result:Theorem 1. There is a forcing extensionL[G] of L in which GCH fails at every regular cardinal.Assume that the universe V of all sets is rich in the sense that it contains inner models with large cardinals. Then what is the relationship between Easton's model L[G] and V? In particular, are these models compatible, in the sense that they are inner models of a common third model? If not, then the failure of GCH at every regular cardinal is consistent only in a weak sense, as it can only hold in universes which are incompatible with the universe of all sets. Ideally, we would like L[G] to not only be compatible with V, but to be an inner model of V.We say that a statement is internally consistent iff it holds in some inner model, under the assumption that there are innermodels with large cardinals. (shrink)

Discussion of new axioms for set theory has often focused on conceptions of maximality, and how these might relate to the iterative conception of set. This paper provides critical appraisal of how certain maximality axioms behave on different conceptions of ontology concerning the iterative conception. In particular, we argue that forms of multiversism (the view that any universe of a certain kind can be extended) and actualism (the view that there are universes that cannot be extended in particular ways) face (...) complementary problems. The latter view is unable to use maximality axioms that make use of extensions, where the former has to contend with the existence of extensions violating maximality axioms. An analysis of two kinds of multiversism, a Zermelian form and Skolemite form, leads to the conclusion that the kind of maximality captured by an axiom differs substantially according to background ontology. (shrink)

There have been numerous results showing that a measurable cardinal κ can carry exactly α normal measures in a model of GCH, where a is a cardinal at most κ⁺⁺. Starting with just one measurable cardinal, we have [9] (for α = 1), [10] (for α = κ⁺⁺, the maximum possible) and [1] (for α = κ⁺, after collapsing κ⁺⁺) . In addition, under stronger large cardinal hypotheses, one can handle the remaining cases: [12] (starting with a measurable cardinal of (...) Mitchell order α ) , [2] (as in [12], but where κ is the least measurable cardinal and α is less than κ, starting with a measurable of high Mitchell order) and [11] (as in [12], but where κ is the least measurable cardinal, starting with an assumption weaker than a measurable cardinal of Mitchell order 2). In this article we treat all cases by a uniform argument, starting with only one measurable cardinal and applying a cofinality-preserving forcing. The proof uses κ-Sacks forcing and the "tuning fork" technique of [8]. In addition, we explore the possibilities for the number of normal measures on a cardinal at which the GCH fails. (shrink)

I discuss three potential sources of evidence for truth in set theory, coming from set theory’s roles as a branch of mathematics and as a foundation for mathematics as well as from the intrinsic maximality feature of the set concept. I predict that new non first-order axioms will be discovered for which there is evidence of all three types, and that these axioms will have significant first-order consequences which will be regarded as true statements of set theory. The bulk of (...) the paper is concerned with the Hyperuniverse Programme, whose aim is to discover an optimal mathematical principle for expressing the maximality of the set-theoretic universe in height and width. (shrink)

In this paper we review the most common forms of reflection and introduce a new form which we call sharp‐generated reflection. We argue that sharp‐generated reflection is the strongest form of reflection which can be regarded as a natural generalization of the Lévy reflection theorem. As an application we formulate the principle sharp‐maximality with the corresponding hypothesis. The statement is an analogue of the (Inner Model Hypothesis, introduced in ) which is compatible with the existence of large cardinals.

In this article, we first offer a model of design knowledge types and their interrelationships in value sensitive design. Then we demonstrate that value sensitive design is a formative framework, which provides a shaping influence on practice, enables creative appropriation, and supports theory and method development.

The fact that “natural” theories, i.e. theories which have something like an “idea” to them, are almost always linearly ordered with regard to logical strength has been called one of the great mysteries of the foundation of mathematics. However, one easily establishes the existence of theories with incomparable logical strengths using self-reference . As a result, PA+Con is not the least theory whose strength is greater than that of PA. But still we can ask: is there a sense in which (...) PA+Con is the least “natural” theory whose strength is greater than that of PA? In this paper we exhibit natural theories in strength strictly between PA and PA+Con by introducing a notion of slow consistency. (shrink)

In this article, we report on eight grand challenges for value sensitive design, which were developed at a one-week workshop, Value Sensitive Design: Charting the Next Decade, Lorentz Center, Leiden, The Netherlands, November 14–18, 2016. A grand challenge is a substantial problem, opportunity, or question that motives sustained research and design activity. The eight grand challenges are: Accounting for Power, Evaluating Value Sensitive Design, Framing and Prioritizing Values, Professional and Industry Appropriation, Tech policy, Values and Human Emotions, Value Sensitive Design (...) and Intelligent Algorithms, and Value Tensions. Each grand challenge consists of a discussion of its importance and a set of tractable key questions. (shrink)

An important technique in large cardinal set theory is that of extending an elementary embedding j: M → N between inner models to an elementary embedding j*: M[G] → N[G*] between generic extensions of them. This technique is crucial both in the study of large cardinal preservation and of internal consistency. In easy cases, such as when forcing to make the GCH hold while preserving a measurable cardinal (via a reverse Easton iteration of α-Cohen forcing for successor cardinals α), the (...) generic G* is simply generated by the image of G. But in difficult cases, such as in Woodin's proof that a hypermeasurable is sufficient to obtain a failure of the GCH at a measurable, a preliminary version of G* must be constructed (possibly in a further generic extension of M[G]) and then modified to provide the required G*. In this article we use perfect trees to reduce some difficult cases to easy ones, using fusion as a substitute for distributivity. We apply our technique to provide a new proof of Woodin's theorem as well as the new result that global domination at inaccessibles (the statement that d (κ) is less than 2κ for inaccessible κ, where d (κ) is the dominating number at κ) is internally consistent, given the existence of 0#. (shrink)

The continuum function αmaps to2α on regular cardinals is known to have great freedom. Let us say that F is an Easton function iff for regular cardinals α and β, image and α<β→F≤F. The classic example of an Easton function is the continuum function αmaps to2α on regular cardinals. If GCH holds then any Easton function is the continuum function on regular cardinals of some cofinality-preserving extension V[G]; we say that F is realised in V[G]. However if we also wish (...) to preserve measurable cardinals, new restrictions must be put on F. We say that κ is F-hypermeasurable iff there is an elementary embedding j:V→M with critical point κ such that H)Vsubset of or equal toM; j will be called a witnessing embedding. We will show that if GCH holds then for any Easton function F there is a cofinality-preserving generic extension V[G] such that if κ, closed under F, is F-hypermeasurable in V and there is a witnessing embedding j such that j≥F, then κ will remain measurable in V[G]. (shrink)

Assuming the existence of a weakly compact hypermeasurable cardinal we prove that in some forcing extension א ω is a strong limit cardinal and א ω+2 has the tree property. This improves a result of Matthew Foreman (see [2]).

Using almost disjoint coding we prove the consistency of the existence of a definable ω-mad family of infinite subsets of ω together with.

It is widely held that individuals who are unable to provide informed consent should be enrolled in clinical research only when the risks are low, or the research offers them the prospect of direct benefit. There is now a rich literature on when the risks of clinical research are low enough to enroll individuals who cannot consent. Much less attention has focused on which benefits of research participation count as ‘direct’, and the few existing accounts disagree over how this crucial (...) concept should be defined. This disagreement raises concern over whether those who cannot consent, including children and adults with severe dementia, are being adequately protected. The present paper attempts to address this concern by considering first what additional protections are needed for these vulnerable individuals. This analysis suggests that the extant definitions of direct benefits either provide insufficient protection for research subjects or pose excessive obstacles to appropriate research. This analysis also points to a modified definition of direct benefits with the potential to avoid these two extremes, protecting individuals who cannot consent without blocking appropriate research. (shrink)

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This is in strong contrast to the case of the isomorphism relation, which as an equivalence relation on graphs (or on any class of countable structures consisting of the models of a sentence of L ω ₁ ω ) is far from complete (see [5, 2]). In (...) this article we strengthen the results of [5] by showing that not only does bi-embeddability give rise to analytic equivalence relations which are complete under Borel reducibility, but in fact any analytic equivalence relation is Borel equivalent to such a relation. This result and the techniques introduced answer questions raised in [5] about the comparison between isomorphism and bi-embeddability. Finally, as in [5] our results apply not only to classes of countable structures defined by sentences of ω ₁ ω , but also to discrete metric or ultrametric Polish spaces, compact metrizable topological spaces and separable Banach spaces, with various notions of embeddability appropriate for these classes, as well as to actions of Polish monoids. (shrink)

The forcing method is a powerful tool to prove the consistency of set-theoretic assertions relative to the consistency of the axioms of set theory. Laver’s theorem and Bukovský’s theorem assert that set-generic extensions of a given ground model constitute a quite reasonable and sufficiently general class of standard models of set-theory.In Sects. 2 and 3 of this note, we give a proof of Bukovsky’s theorem in a modern setting ). In Sect. 4 we check that the multiverse of set-generic extensions (...) can be treated as a collection of countable transitive models in a conservative extension of ZFC. The last section then deals with the problem of the existence of infinitely-many independent buttons, which arose in the modal-theoretic approach to the set-generic multiverse by Hamkins and Loewe :1793–1817, 2008). (shrink)

The foundation scheme in set theory asserts that every nonempty class has an ∈\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\in$$\end{document}-minimal element. In this paper, we investigate the logical strength of the foundation principle in basic set theory and α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}-recursion theory. We take KP set theory without foundation as the base theory. We show that KP-\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^-$$\end{document} + Π1\documentclass[12pt]{minimal} \usepackage{amsmath} (...) \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Pi _1$$\end{document}-Foundation + V=L\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$V=L$$\end{document} is enough to carry out finite injury arguments in α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha$$\end{document}-recursion theory, proving both the Friedberg-Muchnik theorem and the Sacks splitting theorem in this theory. In addition, we compare the strengths of some fragments of KP. (shrink)

The Infinite Time Turing Machine model [8] of Hamkins and Kidder is, in an essential sense, a "Σ₂-machine" in that it uses a Σ₂ Liminf Rule to determine cell values at limit stages of time. We give a generalisation of these machines with an appropriate Σ n rule. Such machines either halt or enter an infinite loop by stage ζ(n) = df μζ(n)[∃Σ(n) > ζ(n) L ζ(n) ≺ Σn L Σ(n) ], again generalising precisely the ITTM case. The collection of (...) such machines taken together computes precisely those reals of the least model of analysis. (shrink)

We show that if M is a countable transitive model of $\text {ZF}$ and if $a,b$ are reals not in M, then there is a G generic over M such that $b \in L[a,G]$. We then present several applications such as the following: if J is any countable transitive model of $\text {ZFC}$ and $M \not \subseteq J$ is another countable transitive model of $\text {ZFC}$ of the same ordinal height $\alpha $, then there is a forcing extension N of (...) J such that $M \cup N$ is not included in any transitive model of $\text {ZFC}$ of height $\alpha $. Also, assuming $0^{\#}$ exists, letting S be the set of reals generic over L, although S is disjoint from the Turing cone above $0^{\#}$, we have that for any non-constructible real a, $\{ a \oplus s : s \in S \}$ is cofinal in the Turing degrees. (shrink)

In this paper we introduce a tree-like forcing notion extending some properties of the random forcing in the context of 2κ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^\kappa$$\end{document}, κ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa$$\end{document} inaccessible, and study its associated ideal of null sets and notion of measurability. This issue was addressed by Shelah ), arXiv:0904.0817, Problem 0.5) and concerns the definition of a forcing which is κκ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} (...) \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\kappa ^\kappa$$\end{document}-bounding, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\,>\,$$\end{document}cov_λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\_\lambda$$\end{document}), arXiv:0904.0817, Problem 0.5), and in this paper we independently reprove this result by using a different type of construction. This also contributes to a line of research adressed in the survey paper :439–456, 2016). (shrink)

In thinking and talking about rights, including property rights, it seems natural to put the argument in either moral or legal terms. From the former viewpoint, rights are part of a description of what actions are right or wrong. The fact that I have a right to do something is an argument, although not necessarily a sufficient argument, that someone who prevents me from doing it is acting wrongly.

Using the Friedman-Koepke Hyperfine Structure Theory of [2], we provide a short construction of a gap 1 morass in the constructible universe.

In this panel, we explore the future of value sensitive design (VSD). The stakes are high. Many in public and private sectors and in civil society are gradually realizing that taking our values seriously implies that we have to ensure that values effectively inform the design of technology which, in turn, shapes people’s lives. Value sensitive design offers a highly developed set of theory, tools, and methods to systematically do so.

The main result in this paper is a method for obtaining derivation trees from sentences of certain formal grammars. No parsing algorithm was previously known to exist for these grammars.Applied to Montague's PTQ the method produces all parses that could correspond to different meanings. The technique directly addresses scope and reference and provides a framework for examining these phenomena. The solution for PTQ is implemented in an efficient and useful computer program.